Some Preemptive open Shop Scheduling Problems with a Renewable or a Nonrenewable Resource. (Discrete Applied Mathematics 35 (1992) 205-219)

نویسندگان

  • Dominique de Werra
  • Jacek Blazewicz
چکیده

De Werra, D. and J. Blazewicz, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Discrete Applied Mathematics 35 (1992) 205-219. An edge coloring model is presented for a preemptive open shop problem. Constraints generated by a single resource have to be taken into account. The case of a renewable and of a nonrenewable resource as considered. Since the existence of a schedule is an NP-complete problem in both cases we present some cases which are solvable in polynomial time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restrictions and Preassignments in Preemptive open Shop Scheduling

Preemptive open shop scheduling can be viewed as an edge coloring problem in a bipartite multigraph. In some applications, restrictions of colors (in particular preassignments) are made for some edges. We give characterizations of graphs where some special preassignments can be embedded in a minimum coloring (number of colors = maximum degree). The case of restricted colorings of trees is shown...

متن کامل

Properties of optimal schedules in preemptive shop scheduling

In this work we show that certain classical preemptive shop scheduling problems with integral data satisfy the following integer preemption property: there exists an optimal preemptive schedule where all interruptions and all starting and completion times occur at integral dates. We also give new upper bounds on the minimal number of interruptions for various shop scheduling problems.

متن کامل

Multi-project scheduling with two-stage decomposition

A non-preemptive, zero time lag multi-project scheduling problem with multiple modes and limited renewable and nonrenewable resources is considered. A 2stage decomposition approach is adopted to formulate the problem as a hierarchy of 0-1 mathematical programming models. At stage one; each project is reduced to a macro-activity with macro-modes. The macro-activities are combined into a single m...

متن کامل

Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

متن کامل

The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach

Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 35  شماره 

صفحات  -

تاریخ انتشار 1992